Π 01 - presentations of algebras ∗
نویسندگان
چکیده
Effectiveness issues in algebra and model theory have been investigated intensively in the last thirty years. One wishes to understand the effective content of model-theoretic and algebraic results, and the interplay between notions of computability, algebra, and model theory. A significant body of work has recently been done in the area, and this is attested by recent series of Handbooks and surveys in computable mathematics, computability, and algebra (see, e.g., [1], [4], [3]). An emphasis has been placed on the study of computable models and algebras. These are the structures whose domains are computable sets of natural numbers, and whose atomic diagrams are computable. The study of computable model theory and algebra can naturally be extended to include a wider class of structures. This can be done by postulating that the atomic diagrams or natural fragments of the atomic diagrams are in some complexity class such as Σn or Π 0 n. These classes of algebras include computably enumerable (c.e.) algebras and co-c.e. algebras which we call Σ1-algebras and Π 0 1-algebras, respectively. Roughly, Σ1-algebras are the ones whose positive atomic diagrams are computably enumerable, and Π1-algebras are the ones whose negative atomic diagrams are computably enumerable. These include finitely presented algebras (e.g. finitely presented groups or rings) and groups generated by finitely many computable permutations of ω. There has been some research on Σ1-algebras (see for example [2], [6], [8], [9]) but not much is known about Π1-algebras and their properties. The main goal of this paper is the study of the question as
منابع مشابه
On the Complexity of the Equational Theory of Relational Action Algebras
Pratt [22] defines action algebras as Kleene algebras with residuals. In [9] it is shown that the equational theory of *-continuous action algebras (lattices) is Π 1−complete. Here we show that the equational theory of relational action algebras (lattices) is Π 1−hard, and some its fragments are Π 1−complete. We also show that the equational theory of action algebras (lattices) of regular langu...
متن کاملA note to the definition of the ÃLΠ - algebras
The ŁΠ-algebras are interesting algebraic structures. They were introduced by Esteva, Godo, and Montagna. These algebras are closely related to the MValgebras and Π-algebras. They have two sets of operations and reduct to one set is an MV-algebra and to the other one is a Π-algebra. Other important reducts of ŁΠ-algebras are so-called PÃ L-algebras (an MV-algebras enriched with product connecti...
متن کاملCompatibility and inheritance in software architectures
The application of formal methods to the development of software depends on the availability of adequate models and formalisms for each of the stages of the development process. In this work, we focus on the level of design called Software Architecture. At this level, the system is described as a collection of interrelated components, and it is here where the properties derived from system’s st...
متن کاملThe dihedral Lie algebras and Galois symmetries of π ( l ) 1 ( P 1 − ( { 0 , ∞ } ∪ μ N ) )
We describe the image of the absolute Galois group acting on the pro-l completion of the fundamental group of the Gm minus Nth roots of unity. We relate the structure of the image with geometry and topology of modular varieties for the congruence subgroups 01(m; N ) of GLm(Z) for m = 1, 2, 3 . . . .
متن کاملF U N D a M E N T a Mathematicae on Monk's Questions
We deal with Boolean algebras and their cardinal functions: π-weight π and π-character πχ. We investigate the spectrum of π-weights of subalgebras of a Boolean algebra B. Next we show that the π-character of an ultraproduct of Boolean algebras may be different from the ultraproduct of the π-characters of the factors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005